Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
نویسندگان
چکیده
منابع مشابه
Multiplicities of Character Values of Binary Sidel'nikov-Lempel-Cohn-Eastman Sequences
Binary Sidel’nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we continue the study of [1]. We first express the multiple roots of character polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making use ...
متن کاملq-ary Lempel–Cohn–Eastman Sequences
In this paper, for a prime p and a positive integer q such that q|pn − 1, we constructed q-ary Lempel– Cohn–Eastman(LCE) sequences with period p − 1. These sequences have maximum autocorrelation magnitude bounded by 4. Particularly, in the case of q = 3, the maximum autocorrelation magnitude of the ternary LCE sequences is 3. And the maximum autocorrelation magnitude of the quaternary LCE seque...
متن کاملSome Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower...
متن کاملLinear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
In this correspondence, the linear complexity over of Lempel–Cohn–Eastman (LCE) sequences of period 1 for an odd prime is determined. For = 3 5 and 7, the exact closed-form expressions for the linear complexity over of LCE sequences of period 1 are derived. Further, the trace representations for LCE sequences of period 1 for = 3 and 5 are found by computing the values of all Fourier coefficient...
متن کاملOn the linear complexity of Legendre-Sidelnikov sequences
Background • Legendre Sequence For a prime p > 2 let (s n) be the Legendre sequence defined as s n = 1, n p = −1, 0, otherwise, n ≥ 0, where. p denotes the Legendre symbol. • Sidelnikov Sequence Let q be an odd prime power, g a primitive element of F q , and let η denote the quadratic character of F Background • Legendre Sequence For a prime p > 2 let (s n) be the Legendre sequence defined as s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2016
ISSN: 1936-2447,1936-2455
DOI: 10.1007/s12095-016-0208-3